Growing uniform planar maps face by face

نویسندگان

چکیده

We provide “growth schemes” for inductively generating uniform random 2 p $$ 2p -angulations of the sphere with n faces, as well simple triangulations 2n faces. In case -angulations, we a way to insert new face at location in -angulation faces such that map is precisely + 1 n+1 Similarly, given triangulation describe two adjacent triangles so obtain 2n+2 The latter based on bijective presentation relies construction by Poulalhon and Schaeffer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of planar two-face maps

We enumerate unrooted planar maps (up to orientation preserving homeomorphism) having two faces, according to the number of vertices and to their vertex and face degree distributions, both in the (vertex) labelled and unlabelled cases. We rst consider plane maps, i.e., maps which are embedded in the plane, and then deduce the case of planar (or sphere) maps, embedded on the sphere. A crucial st...

متن کامل

Enumeration of planar 2 - face maps 1

Up to now, most of the work on maps has dealt with rooted maps, that is, maps with a distinguished and directed edge. We get rid of this restriction in the case of planar maps having two faces. We enumerate these maps according to their vertex and face degree distributions. The following classes of non rooted 2-face maps are treated: (vertex) labelled or unlabelled, embedded in the plane or on ...

متن کامل

Unavoidable set of face types for planar maps

The type of a face f of a planar map is a sequence of degrees of vertices of f as they are encountered when traversing the boundary of f . A set T of face types is found such that in any normal planar map there is a face with type from T . The set T has four infinite series of types as, in a certain sense, the minimum possible number. An analogous result is applied to obtain new upper bounds fo...

متن کامل

Rasterized Planar Face Complex

We consider a Planar Face Complex (PFC). It is defined by the immersion of a planar and connected graph G, which comprises a set of vertices joined by curved edges. G decomposes the plane into faces that need not be manifold or open-regularized and may be bounded by a single loop edge. The PFC may, for example, be used to represent the complex street network of a city, the decomposition of a co...

متن کامل

Face Recognition by Cognitive Discriminant Features

Face recognition is still an active pattern analysis topic. Faces have already been treated as objects or textures, but human face recognition system takes a different approach in face recognition. People refer to faces by their most discriminant features. People usually describe faces in sentences like ``She's snub-nosed'' or ``he's got long nose'' or ``he's got round eyes'' and so like. These...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Random Structures and Algorithms

سال: 2023

ISSN: ['1042-9832', '1098-2418']

DOI: https://doi.org/10.1002/rsa.21165